https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:13118 Wed 24 Jul 2013 22:24:56 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:13038 m given some of its algebraic or trigonometric moments. Using the special structure of this kind of problem, a useful linear relationship among the moments is derived. A simple algorithm then provides a fairly good estimate of x̅ by just solving a couple of linear systems. Numerical computations make the algorithm seem reasonable although the theoretical convergence is still an open problem. Some notes about the error bounds are given at the end of the paper.]]> Wed 11 Apr 2018 13:50:46 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:13096 p spectral estimation problem. The authors use a new constraint qualification (BWCQ) for infinite-dimensional convex programs with linear type constraints recently introduced in [Borwein and Wolkowicz, Math. Programming, 35 (1986), pp. 83-96]. This allows direct derivation of the explicit optimal solution of the problem as presented in [Goodrich and Steinhardt, SIAM J. Appl. Math., 46 (1986), pp. 417-426], and establishment of the existence of a simple and computationally tractable unconstrained Lagrangian dual problem. Moreover, the results illustrate that (BWCQ) is more appropriate to spectral estimation problems than the traditional Slater condition (which may only be applied after transformation of the problem into an L_p space [Goodrich and Steinhardt, op. cit.] and which therefore yields only necessary conditions).]]> Tue 28 May 2019 16:25:49 AEST ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:14232 Sat 24 Mar 2018 08:24:44 AEDT ]]>